The Number of Vertices of Degree k in a Minimally k-Edge-Connected Graph
نویسندگان
چکیده
منابع مشابه
Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs
Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally kconnected/k-edge-connected graphs. We give an overview of the results known for finite graphs, and show that most of these carry over to infinite graphs if we consider ends of small degree as well as vertices.
متن کاملMinimally (k, k-1)-edge-connected graphs
For an interger l > 1, the l-edge-connectivity λl(G) of G is defined to be the smallest number of edges whose removal leaves a graph with at least l components, if |V (G)| ≥ l; and λl(G) = |V (G)| if |V (G)| ≤ l. A graph G is (k, l)-edge-connected if the l-edge-connectivity of G is at least k. A sufficient and necessary condition for G to be minimally (k, k − 1)-edgeconnected is obtained in the...
متن کاملMinimally k-Edge-Connected Directed Graphs of Maximal Size
Let D = (V,E) be a minimally k-edge-connected simple directed graph. We prove that there is a function f(k) such that |V | ≥ f(k) implies |E| ≤ 2k(|V | − k). We also determine the extremal graphs whose size attains this upper bound.
متن کاملThe number of vertices of degree 5 in a contraction-critically 5-connected graph
An edge of a k-connected graph is said to be k-contractible if its contraction yields a k-connected graph. A non-complete k-connected graph possessing no k-contractible edges is called contraction-critical k-connected. Let G be a contraction-critical 7-connected graph with n vertices, and V7 the set of vertices of degree 7 in G. In this paper, we prove that |V7| ≥ n 22 , which improves the resu...
متن کاملSufficient degree conditions for k-edge-connectedness of a graph
One of Frank Boesch’s best known papers is ‘The strongest monotone degree conditions for n-connectedness of a graph’ [1]. In this paper, we give a simple sufficient degree condition for a graph to be k-edge-connected, and also give the strongest monotone condition for a graph to be 2-edge-connected.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1993
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1039